1873F - Money Trees - CodeForces Solution

#include <bits/stdc++.h>
const int N = 1e5 + 10;
typedef long long ll;
#define int long long
#define endl '\n'
#define INF 0x7fffffff
#define fi first
#define se second
#define pii pair<int, int>
#define YES                                                                                                            \
    {                                                                                                                  \
        cout << "YES" << endl;                                                                                         \
        return;                                                                                                        \
    }
#define NO                                                                                                             \
    {                                                                                                                  \
        cout << "NO" << endl;                                                                                          \
        return;                                                                                                        \
    }
 
using namespace std;
 
// struct node
// {
//
// };
//
// bool cmp(const node& x,node& y)
// {
//     return x.<y.;
// }
 
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1, INT_MAX);
    vector<int> b(n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> b[i];
    }
 
    vector<pair<int, int>> p;
 
    for (int i = 1; i <= n; i++)
    {
        if (i + 1 <= n && b[i] % b[i + 1] == 0)
        {
            int j = i;
            while (j + 1 <= n && b[j] % b[j + 1] == 0)
            {
                j++;
            }
            p.push_back({i, j});
            i = j;
        }
    }
    int len = 0;
    for (auto x : p)
    {
        int l = x.first, r = x.first;
        int temp = a[r];
        while (r <= x.second)
        {
            if (temp <= m)
                len = max(len, r - l + 1);
            r++;
            if (r <= x.second)
                temp += a[r];
            else
                break;
            while (temp > m && l <= r)
            {
                temp -= a[l];
                l++;
            }
        }
 
        if (temp <= m)
            len = max(len, r - l);
    }
    if (len == 0)
    {
    	int x = *min_element(a.begin(),a.end());
        if (x <= m) cout<<1<<endl;
        else cout<<0<<endl;
    }
    else
    {
        cout << len << endl;
    }
}
 
signed main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int __ = 1;
    cin >> __;
    while (__--)
        solve();
}